Freeport Union Free School District and Freeport Non-Teaching Unit (Custodial Unit), CSEA Local 1000, AFSCME, AFL-CIO

In the matter of the fact-finding between the Freeport Union Free School District, employer, and the Freeport Non-Teaching Unit (Custodial Unit), CSEA Local 1000, AFSCME, AFL-CIO, union. PERB case no. M2010-313. Before: Eugene S. Ginsberg, fact finder

Odious Debt, Odious Credit, Economic Development, and Democratization

When a country signs an international treaty, it is not the government but the state that is bound, and the obligation will stand until a subsequent government formally exits the treaty. Exit is presumed to be costly: a government that repudiates earlier treaty obligations will suffer reputational harm in its international relations. Moreover, this general background norm of international law applies as well to debt: a government can announce that it is renouncing debt, but it will suffer severe reputational harm in the debt marketplace, much as a government that repudiates public international law obligations suffers a reputational harm. Here, Ginsburg and Ulen talks about the odious debt and odious credit in relation to economic development and democratization

Capacity Bounded Grammars and Petri Nets

A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts are investigated

Making Medical Homes Work: Moving From Concept to Practice

Explores practical considerations for implementing a medical home program of physician practices committed to coordinating and integrating care based on patient needs and priorities, such as how to qualify medical homes and how to match patients to them

Ultimate periodicity of b-recognisable sets : a quasilinear procedure

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can verified in linear time if a given minimal automaton meets this description. This thus yields a O(n log(n)) procedure for deciding whether a general deterministic automaton accepts an ultimately periodic set of numbers.Comment: presented at DLT 201